Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
نویسندگان
چکیده
منابع مشابه
Cumulative Scheduling with Task Intervals
This paper presents a set of propagation rules to solve cumulative constraints. As in our previous paper on jobshop scheduling [8], our goal is to propose to the CLP community techniques that allow a constraint satisfaction program to obtain performances which are competitive with ad-hoc approaches. The rules that we propose are a mix of an extension of the concept of task intervals to the cumu...
متن کاملDiscrete piecewise linear functions
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is used to establish lattice polynomial representations of piecewise linear functions on R and continuous selectors on linear orders.
متن کاملConcave piecewise linear service curves and deadline calculations
The Internet is gradually and constantly becoming a multimedia network that needs mechanisms to provide effective quality of service (QoS) requirements to users. The service curve (SC) is an efficient description of QoS and the service curve based earliest deadline first policy (SCED) is a scheduling algorithm to guarantee SCs specified by users. In SCED, deadline calculation is the core. Howev...
متن کاملThe radar method: an effective line search for piecewise linear concave functions
The maximization of one-dimensional piecewise linear concave (OPLC) functions arises in the line search associated with the maximization of piecewise linear concave functions (e.g. Kelley cutting plane method). The OPLC line search is usually done by the next-break-point method, where one goes from break point to break point up to the optimum. If the number of break points is large this method ...
متن کاملAn algorithm for approximating piecewise linear concave functions from sample gradients
An e ective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and eet management. These algorithms require the adaptive estimation of the app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2017
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-017-9271-4